For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids

An example of a nitely presented monoid is given that does not satisfy the homo-topical niteness condition FHT, although it satisses both the homological niteness conditions left FP 1 and right FP 1 .tions left FP 1 and right FP 1 .

متن کامل

The Finiteness of Finitely Presented Monoids

Introduction. It is undecidable whether a monoid given by a nite presentation is nite (see, e.g., [1], pp. 157{160). On the other hand, with the mere knowledge that the monoid is nite, one can e ectively construct the multiplication table of the monoid, and thus obtain a complete understanding of its structure. This paper will present this construction method in detail (Section 2) and o er some...

متن کامل

Homological finiteness conditions for groups, monoids and algebras

Recently several different homological finitenes conditions have been introduced for monoids. I will survey the interplay between these notions. It is, in fact, more natural (and more illuminating) to work in the wider context of associative algebras.

متن کامل

On Dehn Functions of Finitely Presented Bi-Automatic Monoids

For each automatic monoid the word problem can be solved in quadratic time (Campbell et al 1996), and hence, the Dehn function of a nitely presented automatic monoid is recursive. Here we show that this result on the Dehn function cannot be improved in general by presenting nitely presented bi-automatic monoids the Dehn functions of which realize arbitrary complexity classes that are suuciently...

متن کامل

Decidability and Independence of Conjugacy Problems in Finitely Presented Monoids

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by ∼p, ∼o, and ∼c) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, p-conjugacy is “almost” transitive, ∼c is stric...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2003

ISSN: 0021-8693

DOI: 10.1016/s0021-8693(03)00177-7